Fast Large-Scale Boundary Element Algorithms

نویسندگان

چکیده

Boundary element methods (BEM) reduce a partial differential equation in domain to an integral on the domain’s boundary. They are particularly attractive for solving problems unbounded domains, but handling dense matrices corresponding operators requires efficient algorithms.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fast Algorithms for Large-Scale Phylogenetic Reconstruction

One of the most fundamental computational problems in biology is that of inferring evolutionary histories of groups of species from sequence data. Such evolutionary histories, known as phylogenies are usually represented as binary trees where leaves represent extant species, whereas internal nodes represent their shared ancestors. As the amount of sequence data available to biologists increases...

متن کامل

Large-scale modeling of carbon-nanotube composites by a fast multipole boundary element method

Carbon nanotubes (CNTs) exhibit extremely high stiffness and strength, and are regarded as perfect reinforcing fibers for developing a new class of nanocomposites. The use of atomistic or molecular dynamics (MD) simulations is inevitable for the analysis of such nanomaterials in order to study the local load transfers, interface properties, or failure modes at the nanoscale. Meanwhile, continuu...

متن کامل

A new fast multipole boundary element method for solving large-scale two-dimensional elastostatic problems

A new fast multipole boundary element method (BEM) is presented in this paper for large-scale analysis of two-dimensional (2-D) elastostatic problems based on the direct boundary integral equation (BIE) formulation. In this new formulation, the fundamental solution for 2-D elasticity is written in a complex form using the two complex potential functions in 2-D elasticity. In this way, the multi...

متن کامل

Fast Boundary Element Method Solutions for Three Dimensional Large Scale Problems

Dedicated to my dear parents iv ACKNOWLEDGEMENT Until after I finished the study for my Ph.D. degree, did I realize the hard work and relentless effort needed for such a title with honors. My advisor, Dr. Wenjing Ye, guided me through this path, which is filled with thistles and thorns as well as flowers and happiness, using her patience, love and care for her students, her insight in issues in...

متن کامل

Fast algorithms for large-scale genome alignment and comparison.

We describe a suffix-tree algorithm that can align the entire genome sequences of eukaryotic and prokaryotic organisms with minimal use of computer time and memory. The new system, MUMmer 2, runs three times faster while using one-third as much memory as the original MUMmer system. It has been used successfully to align the entire human and mouse genomes to each other, and to align numerous sma...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Lecture Notes in Computer Science

سال: 2021

ISSN: ['1611-3349', '0302-9743']

DOI: https://doi.org/10.1007/978-3-030-67077-1_4